Extensible Resource Scheduling for Parallel Scientific Applications
نویسندگان
چکیده
The resource requirements and processing characteristics of parallel scientiic applications are quite diverse. In this paper, we present a new resource management approach for scheduling such parallel applications that combines multiple scheduling paradigms with a fault-tolerance paradigm into a coherent system. Results from a prototype implementation demonstrate that our system provides signiicant performance improvements over existing methods in a controllable and extensible manner.
منابع مشابه
Extensible Resource Management for Cluster Computing
Advanced general-purpose parallel systems should be able to support diverse applications with diier-ent resource requirements without compromising eeec-tiveness and eeciency. We present a new resource management model for cluster computing that allows multiple scheduling policies to co-exist dynamically. In particular, we have built Octopus, an extensible and distributed hierarchical scheduler ...
متن کاملModeling and Solution Procedure for a Preemptive Multi-Objective Multi-Mode Project Scheduling Model in Resource Investment Problems
In this paper, a preemptive multi-objective multi-mode project scheduling model for resource investment problem is proposed. The first objective function is to minimize the completion time of project (makespan);the second objective function is to minimize the cost of using renewable resources. Non-renewable resources are also considered as parameters in this model. The preemption of activities ...
متن کاملIntegrated scheduling: the best of both worlds
This paper presents a new paradigm for parallel job scheduling called integrated scheduling or iScheduling. The iScheduler is an application-aware job scheduler as opposed to a general-purpose system scheduler. It dynamically controls resource allocation among a set of competing applications, but unlike a traditional job scheduler, it can interact directly with an application during execution t...
متن کاملParallelizing with BDSC, a resource-constrained scheduling algorithm for shared and distributed memory systems
We introduce a new parallelization framework for scientific computing based on BDSC, an efficient automatic scheduling algorithm for parallel programs in the presence of resource constraints on the number of processors and their local memory size. BDSC extends Yang and Gerasoulis’s Dominant Sequence Clustering (DSC) algorithm; it uses sophisticated cost models and addresses both shared and dist...
متن کاملSolving the Problem of Scheduling Unrelated Parallel Machines with Limited Access to Jobs
Nowadays, by successful application of on time production concept in other concepts like production management and storage, the need to complete the processing of jobs in their delivery time is considered a key issue in industrial environments. Unrelated parallel machines scheduling is a general mood of classic problems of parallel machines. In some of the applications of unrelated parallel mac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997